Graphs whose normalized Laplacian has three eigenvalues

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Bounds on normalized Laplacian eigenvalues of graphs

*Correspondence: [email protected] 1School of Mathematics and Statistics, Minnan Normal University, Zhangzhou, Fujian, P.R. China 2Center for Discrete Mathematics, Fuzhou University, Fuzhou, Fujian, P.R. China Full list of author information is available at the end of the article Abstract Let G be a simple connected graph of order n, where n≥ 2. Its normalized Laplacian eigenvalues are 0 = λ1 ...

متن کامل

Note on the normalized Laplacian eigenvalues of signed graphs

The normalized Laplacian of a graph was introduced by F.R.K. Chung and has been studied extensively over the last decade. In this paper, we introduce the notion of the normalized Laplacian of signed graphs and extend some fundamental concepts of the normalized Laplacian from graphs to signed graphs.

متن کامل

Eigenvalues of the normalized Laplacian

A graph can be associated with a matrix in several ways. For instance, by associating the vertices of the graph to the rows/columns and then using 1 to indicate an edge and 0 otherwise we get the adjacency matrix A. The combinatorial Laplacian matrix is defined by L = D − A where D is a diagonal matrix with diagonal entries the degrees and A is again the adjacency matrix. Both of these matrices...

متن کامل

Normalized laplacian spectrum of two new types of join graphs

‎Let $G$ be a graph without an isolated vertex‎, ‎the normalized Laplacian matrix $tilde{mathcal{L}}(G)$‎ ‎is defined as $tilde{mathcal{L}}(G)=mathcal{D}^{-frac{1}{2}}mathcal{L}(G)mathcal{D}^{-frac{1}{2}}$‎, where ‎$mathcal{D}$ ‎is a‎ diagonal matrix whose entries are degree of ‎vertices ‎‎of ‎$‎G‎$‎‎. ‎The eigenvalues of‎ $tilde{mathcal{L}}(G)$ are ‎called as ‎the ‎normalized Laplacian eigenva...

متن کامل

Limit points for normalized Laplacian eigenvalues

Limit points for the positive eigenvalues of the normalized Laplacian matrix of a graph are considered. Specifically, it is shown that the set of limit points for the j-th smallest such eigenvalues is equal to [0, 1], while the set of limit points for the j-th largest such eigenvalues is equal to [1, 2]. Limit points for certain functions of the eigenvalues, motivated by considerations for rand...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Linear Algebra and its Applications

سال: 2011

ISSN: 0024-3795

DOI: 10.1016/j.laa.2011.02.005